The Complexity of Wheel Graphs with Multiple Edges and Vertices
نویسندگان
چکیده
In this paper, we focus on calculate the number of spanning trees general wheel graphs, which meansthe original graphs adding large amount vertices and edges. Particularly, introduce C-graphand deduce a new equation that computing by removing C-graphs instead edges.In Addition, test our results Kirchhoff’s matrix-tree theorem in some simple cases provide thetree entropy graphs. Finally, analyse relation between graph anddouble-wheel propose idea calculating double-wheel
منابع مشابه
Flipping edges and vertices in graphs
We study a certain random process on a graph G which is a variation of a classical voter model and is also a special case of the so-called Tsetlin library random walk. Initially each vertex of G is colored either blue or red. At each step an edge is chosen at random and both endpoints change their colors to blue with probability p and to red otherwise. This edge-flipping process corresponds to ...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولDrawing Planar Graphs with Large Vertices and Thick Edges
We consider the problem of representing size information in the edges and vertices of a planar graph. Such information can be used, for example, to depict a network of computers and information traveling through the network. We present an efficient linear-time algorithm which draws edges and vertices of varying 2-dimensional areas to represent the amount of information flowing through them. The...
متن کاملDrawing Graphs with Vertices and Edges in Convex Position
A graph has strong convex dimension 2 if it admits a straightline drawing in the plane such that its vertices form a convex set and the midpoints of its edges also constitute a convex set. Halman, Onn, and Rothblum conjectured that graphs of strong convex dimension 2 are planar and therefore have at most 3n− 6 edges. We prove that all such graphs have indeed at most 2n − 3 edges, while on the o...
متن کاملDesigns for graphs with six vertices and nine edges
The design spectrum has been determined for eleven of the 21 graphs with six vertices and nine edges. In this paper we completely solve the design spectrum problem for the remaining ten graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Asian research journal of mathematics
سال: 2023
ISSN: ['2456-477X']
DOI: https://doi.org/10.9734/arjom/2023/v19i9694